Efficient Parallel IP Address Lookup Architecture with Smart Distributor
نویسندگان
چکیده
منابع مشابه
Efficient Hardware Architecture for Fast IP Address Lookup
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forwarding table in order to determine the packet’s next-hop. In this paper, we present an efficient hardware solution for the IP address lookup problem. We model the address lookup problem as a searching problem on a binar...
متن کاملA New Efficient IP Address Lookup Based on Binary Search
IP address lookup is an important function in a router to settle overall performance of the router. Binary search on range is a useful algorithm based on binary search for IP address lookup. However, this approach requires a lot of memories for adapting binary search to variable-length prefixes. We propose the improved algorithm to reduce memory requirements than binary search on range dramatic...
متن کاملIP-address lookup using LC-tries
There has recently been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest is primarily motivated by the goal of building multi-Gb/s routers for the Internet, without having to rely on multi-layer switching techniques. We address this problem by using an LC-trie, a trie structure with combined path and level compression. This data s...
متن کاملIP-Address Lookup Using Hardware Pipelining
Fast IP address lookup mechanism is a major design issue for the next generation routers. The existing scheme performs the IP address lookup by hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this article, we claim that with a little extra memory, it is able to further reduce the lookup time...
متن کاملUniversit a Di Pisa Ip Address Lookup Made Fast and Simple Ip Address Lookup Made Fast and Simple
The IP address lookup problem is one of the major bottlenecks in high performance routers. Previous solutions to this problem rst describe it in the general terms of longest preex matching and, then, are experimented on real routing tables T. In this paper, we follow the opposite direction. We start out from the experimental analysis of real data and, based upon our ndings, we provide a new and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea Contents Association
سال: 2013
ISSN: 1598-4877
DOI: 10.5392/jkca.2013.13.02.044